Course contents: Basic of data encoding and storage, machine architecture and machine languages, operating systems, networking and the Internet, algorithms and algorithm design, programming languages, software engineering, data abstractions.

At the end of the course the student will be able to:

• Convert numbers between decimal, binary and hexadecimal and be able to perform simple numerical operations in binary
• Use gates to design simple circuits
• Recognize basic components of computer architecture
• Develop simple programs in a low-level language
• Explain functions of an Operating System and select suitable commands in UNIX
• Describe the basic operating principles of networks and Internet and be able to write a simple page in HTML
• Structure problems using tools such as Turing machines
• Compute the complexity of algorithms
• Design algorithms to solve problems

Assessment: Optional exercises counting for 25% of the final grade, and written exam for 75% of the final grade. In case a mid-term exam is given, the final grade is computed as: 25% exercises + 25% mid-term exam + 50% final exam. September re-sits for 100% of the grade (other grades such as exercises or mid-term exam are discarded).